翻訳と辞書 Words near each other ・ De Delftse Pauw ・ De delictis gravioribus ・ De Deyselhof ・ De Dhakka ・ De dicto and de re ・ De Diesbach Castle ・ De Dietrich ・ De Dietrich Ferroviaire ・ De Bono ・ De bono mortis ・ De Bono's invasion of Abyssinia ・ De Bonstetten ・ De Bonte Hen, Zaandam ・ De Bonte Wever ・ De Boor ・ De Boor's algorithm ・ De Borchgrave d'Altena ・ De Borgia Schoolhouse ・ De Borgia, Montana ・ De Borgmolen, Grou ・ De Bort ・ De Bortoli Wines ・ De Bosjes ・ De Boterbloem ・ De Bothezat helicopter ・ De Bouches à Oreilles ・ De Bourdeille ・ De Bow's Review ・ De Brancas ・ De Branges space Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク De Boor's algorithm ： ウィキペディア英語版 De Boor's algorithm In the mathematical subfield of numerical analysis the de Boor's algorithm is a fast and numerically stable algorithm for evaluating spline curves in B-spline form. It is a generalization of the de Casteljau's algorithm for Bézier curves. The algorithm was devised by Carl R. de Boor. Simplified, potentially faster variants of the de Boor algorithm have been created but they suffer from comparatively lower stability. == Introduction == The general setting is as follows. We would like to construct a curve whose shape is described by a sequence of ''p'' points $\backslash mathbf\_0,\; \backslash mathbf\_1,\; \backslash dots,\; \backslash mathbf\_$, which plays the role of a ''control polygon''. The curve can be described as a function $\backslash mathbf(x)$ of one parameter ''x''. To pass through the sequence of points, the curve must satisfy $\backslash mathbf(u\_0)=\backslash mathbf\_0,\; \backslash dots,$ \mathbf(u_)=\mathbf_. But this is not quite the case: in general we are satisfied that the curve "approximates" the control polygon. We assume that ''u0, ..., up-1'' are given to us along with $\backslash mathbf\_0,\; \backslash mathbf\_1,\; \backslash dots,\; \backslash mathbf\_$. One approach to solve this problem is by splines. A spline is a curve that is a piecewise ''nth'' degree polynomial. This means that, on any interval ''[ui, ui+1)'', the curve must be equal to a polynomial of degree at most ''n''. It may be equal to different polynomials on different intervals. The polynomials must be ''synchronized'': when the polynomials from intervals ''[ui-1, ui)'' and ''[ui, ui+1)'' meet at the point ''ui'', they must have the same value at this point and their derivatives must be equal (to ensure that the curve is smooth). De Boor's algorithm is an algorithm which, given ''u0, ..., up-1'' and $\backslash mathbf\_0,\; \backslash mathbf\_1,\; \backslash dots,\; \backslash mathbf\_$, finds the value of spline curve $\backslash mathbf(x)$ at a point ''x''. It uses O(n2) + O(n + p) operations where ''n'' is the degree and ''p'' the number of control points of ''s''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「De Boor's algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.